On idempotent generated semigroups

We provide short and direct proofs for some classical theorems proved by Howie, Levi and McFadden concerning idempotent generated semigroups of transformations on a finite set.Comment: three page

Two Generalizations of Homogeneity in Groups with Applications to Regular Semigroups

Let $X$ be a finite set such that $|X|=n$ and let $i\leq j \leq n$. A group G\leq \sym is said to be $(i,j)$-homogeneous if for every $I,J\subseteq X$, such that $|I|=i$ and $|J|=j$, there exists $g\in G$ such that $Ig\subseteq J$. (Clearly $(i,i)$-homogeneity is $i$-homogeneity in the usual sense.) A group G\leq \sym is said to have the $k$-universal transversal property if given any set $I\subseteq X$ (with $|I|=k$) and any partition $P$ of $X$ into $k$ blocks, there exists $g\in G$ such that $Ig$ is a section for $P$. (That is, the orbit of each $k$-subset of $X$ contains a section for each $k$-partition of $X$.) In this paper we classify the groups with the $k$-universal transversal property (with the exception of two classes of 2-homogeneous groups) and the $(k-1,k)$-homogeneous groups (for $2<k\leq \lfloor \frac{n+1}{2}\rfloor$). As a corollary of the classification we prove that a $(k-1,k)$-homogeneous group is also $(k-2,k-1)$-homogeneous, with two exceptions; and similarly, but with no exceptions, groups having the $k$-universal transversal property have the $(k-1)$-universal transversal property. A corollary of all the previous results is a classification of the groups that together with any rank $k$ transformation on $X$ generate a regular semigroup (for $1\leq k\leq \lfloor \frac{n+1}{2}\rfloor$). The paper ends with a number of challenges for experts in number theory, group and/or semigroup theory, linear algebra and matrix theory.Comment: Includes changes suggested by the referee of the Transactions of the AMS. We gratefully thank the referee for an outstanding report that was very helpful. We also thank Peter M. Neumann for the enlightening conversations at the early stages of this investigatio

On Positional Consumption and Technological Innovation- an Agent-based Approach

Positional behavior is a source of externalities and sets limits to wellbeing. Remedies against this market failure are defended by some authors and rejected by others, while the core of the discussion rests on the benefits and costs of applying economic instruments. One of the issues discussed is the role that the competition for positional goods may have in generating technological innovation. This paper aims to contribute to the understanding of this process by analyzing an agent-based model. We observe a plausible structure of the dynamics behind the process of generation of technological innovation by positional consumption and obtain results on the influence of some key factors on the pace of innovation, particularly those of income inequality, the Hirsch conjecture of relative increase of positional consumption with affluence, and consumer network and social neighborhood sizes.Positional consumption, innovation, agent-based models, Robert Frank

Primitive Groups Synchronize Non-uniform Maps of Extreme Ranks

Let $\Omega$ be a set of cardinality $n$, $G$ a permutation group on $\Omega$, and $f:\Omega\to\Omega$ a map which is not a permutation. We say that $G$ synchronizes $f$ if the semigroup $\langle G,f\rangle$ contains a constant map. The first author has conjectured that a primitive group synchronizes any map whose kernel is non-uniform. Rystsov proved one instance of this conjecture, namely, degree $n$ primitive groups synchronize maps of rank $n-1$ (thus, maps with kernel type $(2,1,\ldots,1)$). We prove some extensions of Rystsov's result, including this: a primitive group synchronizes every map whose kernel type is $(k,1,\ldots,1)$. Incidentally this result provides a new characterization of imprimitive groups. We also prove that the conjecture above holds for maps of extreme ranks, that is, ranks 3, 4 and $n-2$. These proofs use a graph-theoretic technique due to the second author: a transformation semigroup fails to contain a constant map if and only if it is contained in the endomorphism semigroup of a non-null (simple undircted) graph. The paper finishes with a number of open problems, whose solutions will certainly require very delicate graph theoretical considerations.Comment: Includes changes suggested by the referee of the Journal of Combinatorial Theory, Series B - Elsevier. We are very grateful to the referee for the detailed, helpful and careful repor

National industry cluster templates and the structure of industry output dynamics: a stochastic geometry approach

Cluster analysis has been widely used in an Input-Output framework, with the main objective of uncover the structure of production, in order to better identify which sectors are strongly connected with each other and choose the key sectors of a national or regional economy. There are many empirical studies determining potential clusters from interindustry flows directly, or from their corresponding technical (demand) or market (supply) coefficients, most of them applying multivariate statistical techniques. In this paper, after identifying clusters this way, and since it may be expected that strongly (interindustry) connected sectors share a similar growth and development path, the structure of sectoral dynamics is uncovered, by means of a stochastic geometry technique based on the correlations of industry outputs in a given period of time. An application is made, using Portuguese input-output data, and the results do not clearly support this expectation.Clusters, Input-output analysis, Industry output dynamics

The Largest Subsemilattices of the Endomorphism Monoid of an Independence Algebra

An algebra \A is said to be an independence algebra if it is a matroid algebra and every map \al:X\to A, defined on a basis $X$ of \A, can be extended to an endomorphism of \A. These algebras are particularly well behaved generalizations of vector spaces, and hence they naturally appear in several branches of mathematics such as model theory, group theory, and semigroup theory. It is well known that matroid algebras have a well defined notion of dimension. Let \A be any independence algebra of finite dimension $n$, with at least two elements. Denote by \End(\A) the monoid of endomorphisms of \A. We prove that a largest subsemilattice of \End(\A) has either $2^{n-1}$ elements (if the clone of \A does not contain any constant operations) or $2^n$ elements (if the clone of \A contains constant operations). As corollaries, we obtain formulas for the size of the largest subsemilattices of: some variants of the monoid of linear operators of a finite-dimensional vector space, the monoid of full transformations on a finite set $X$, the monoid of partial transformations on $X$, the monoid of endomorphisms of a free $G$-set with a finite set of free generators, among others. The paper ends with a relatively large number of problems that might attract attention of experts in linear algebra, ring theory, extremal combinatorics, group theory, semigroup theory, universal algebraic geometry, and universal algebra.Comment: To appear in Linear Algebra and its Application

A Stochastic discount factor approach to asset pricing using panel data asymptotics

Using the Pricing Equation in a panel-data framework, we construct a novelconsistent estimator of the stochastic discount factor (SDF) which relies on thefact that its logarithm is the "common feature" in every asset return of theeconomy. Our estimator is a simple function of asset returns and does notdepend on any parametric function representing preferences.The techniques discussed in this paper were applied to two relevant issues inmacroeconomics and finance: the first asks what type of parametric preference-representation could be validated by asset-return data, and the second askswhether or not our SDF estimator can price returns in an out-of-sample forecasting exercise.In formal testing, we cannot reject standard preference specifications used inthe macro/finance literature. Estimates of the relative risk-aversion coefficientare between 1 and 2, and statistically equal to unity.We also show that our SDF proxy can price reasonably well the returns ofstocks with a higher capitalization level, whereas it shows some difficulty inpricing stocks with a lower level of capitalization.